Elastic Graph Matching versus Linear Subspace Methods for Frontal Face Verification
نویسندگان
چکیده
In this paper, a comparative study between standard linear subspace techniques such as eigenfaces and fisherfaces and a novel morphological elastic graph matching for frontal face verification is presented. A set of experiments has been conducted in the M2VTS database in order to investigate the performance of each algorithm in different image alignment conditions. The experimental results indicate the superiority of the novel morphological elastic graph matching against all the other presented techniques.
منابع مشابه
Using Support Vector Machines for Face Authentication Based on Elastic Graph Matching
In this paper, a novel method for enhancing the performance of elastic graph matching in face authentication is proposed. Our objective is to weigh the local matching errors at the nodes of an elastic graph according to their discriminatory power. We propose a novel approach to discriminant analysis that re-formulates Fisher’s Linear Discriminant ratio to a quadratic optimization problem subjec...
متن کاملFace authentication by using elastic graph matching and support vector machines
In this paper, a novel method for enhancing the performance of elastic graph matching in face authentication is proposed. The starting point is to weigh the local matching errors at the nodes of an elastic graph according to their discriminatory power. We propose a novel approach to discriminant analysis that re-formulates Fisher's Linear Discriminant ratio to a quadratic optimization problem s...
متن کاملImage Analysis for Face Recognition
In recent years face recognition has received substantial attention from both research communities and the market, but still remained very challenging in real applications. A lot of face recognition algorithms, along with their modifications, have been developed during the past decades. A number of typical algorithms are presented, being categorized into appearancebased and model-based schemes....
متن کاملMorphological elastic graph matching applied to frontal face authentication under well-controlled and real conditions
In this paper, morphological elastic graph matching is applied to frontal face authentication on databases ranging from small to large multimedia ones collected under either well-controlled or real-world conditions. It is shown that the morphological elastic graph matching achieves a very low equal error rate on databases collected under well-controlled conditions. However, its performance dete...
متن کاملFrontal face authentication using discriminating
A novel elastic graph matching procedure based on multiscale morphological operations, the so called morphological dynamic link architecture, is developed for frontal face authentication. Fast algorithms for implementing mathematical morphology operations are presented. Feature selection by employing linear projection algorithms is proposed. Discriminatory power coeecients that weigh the matchi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005